منابع مشابه
Solving 0-1 knapsack problems based on amoeboid organism algorithm
The 0-1 knapsack problem is an open issue in discrete optimization problems, which plays an important role in real applications. In this paper, a new bio-inspired model is proposed to solve this problem. The proposed method has three main steps. First, the 0-1 knapsack problem is converted into a directed graph by the network converting algorithm. Then, for the purpose of using the amoeboid org...
متن کاملSolving the Towers of Hanoi - how an amoeboid organism efficiently constructs transport networks.
Many biological systems require extensive networks to transport resources and information. Biological networks must trade-off network efficiency with the risk of network failure. Yet, biological networks develop in the absence of centralised control from the interactions of many components. Moreover, many biological systems need to be able to adapt when conditions change and the network require...
متن کاملMaze solving by chemotactic droplets.
Droplets emitting surface-active chemicals exhibit chemotaxis toward low-pH regions. Such droplets are self-propelled and navigate through a complex maze to seek a source of acid placed at one of the maze's exits. In doing so, the droplets find the shortest path through the maze. Chemotaxis and maze solving are due to an interplay between acid/base chemistry and surface tension effects.
متن کاملAmoeboid organism solves complex nutritional challenges.
A fundamental question in nutritional biology is how distributed systems maintain an optimal supply of multiple nutrients essential for life and reproduction. In the case of animals, the nutritional requirements of the cells within the body are coordinated by the brain in neural and chemical dialogue with sensory systems and peripheral organs. At the level of an insect society, the requirements...
متن کاملMental maze solving.
We sought to determine how a visual maze is mentally solved. Human subjects (N = 13) viewed mazes with orthogonal, unbranched paths; each subject solved 200-600 mazes in any specific experiment below. There were four to six openings at the perimeter of the maze, of which four were labeled: one was the entry point and the remainder were potential exits marked by Arabic numerals. Starting at the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2000
ISSN: 0028-0836,1476-4687
DOI: 10.1038/35035159